Building and Interpreting Clausal Possession in Isbukun Bunun

Resolving Vowel Clusters: A Comparison of Isbukun Bunun and Squliq Atayal

The goals of this paper are to identify, compare, and account for the ways suffixation-induced vowel clusters are handled in Isbukun Bunun and Squliq Atayal, two Formosan Austronesian languages. Despite the fact that the two languages have distinct segmental inventories and prosodic characteristics, Isbukun and Squliq are shown to be strikingly similar in adopting both glide formation and coale...

Towards Building Proofs of Past Data Possession in Cloud Forensics

Cloud computing has emerged as a popular computing paradigm in recent years. However, today’s cloud computing architectures often lack support for computer forensic investigations. A key task of digital forensics is to prove the presence of a particular file in a given storage system. Unfortunately, it is very hard to do so in a cloud given the black-box nature of clouds and the multi-tenant cl...

A Combination of Clausal and Non Clausal Temporal Logic Programs

We have developped Tokio interpreter[5] for rst order Inteval Temporal Logic[11] and an automatic theorem prover [6, 7] for Propositional Interval Temporal Logic. The veri er features deterministic tableau expansion and binary decision tree representation of subterms. Combining these, we can avoid repeated similar clausal form time constraints, and it is possible to execute wider range of speci...

Rewrite Methods for Clausal and Non-Clausal Theorem Proving

Effective theorem provers are essential for automatic verification and generation of programs. The conventional resolution strategies, albeit complete, are inefficient. On the other hand, special purpose methods, such as term rewriting systems for solving word problems, are relatively efficient but applicable to only limited classes of problems. In this paper, a simple canonical set of rewrite ...

Clausal Complementation and Selection